Refutation calculi for certain intermediate propositional logics.
نویسندگان
چکیده
منابع مشابه
Approximating Propositional Calculi by Finite-Valued Logics
Bernays introduced a method for proving underivability results in propositional calculi C by truth tables. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the best candidate matrices for (1) can be computed from the calculus, and how sequences for (2) can be found for certain classes of logics. Furthermore, ...
متن کاملHypersequent and Labelled Calculi for Intermediate Logics
Hypersequent and labelled calculi are often viewed as antagonist formalisms to define cut-free calculi for non-classical logics. We focus on the class of intermediate logics to investigate the methods of turning Hilbert axioms into hypersequent rules and frame conditions into labelled rules. We show that these methods are closely related and we extend them to capture larger classes of intermedi...
متن کاملAlmost Duplication-Free Tableau Calculi for Propositional Lax Logics
In this paper we provide tableau calculi for the intuitionistic modal logics PLL and PLL 1 , where the calculus for PLL 1 is duplication{free while among the rules for PLL there is just one rule that allows duplication of formulas. These logics have been investigated by Fairtlough and Mendler in relation to the problem of Formal Hardware Veriication. In order to develop these calculi we extend ...
متن کاملCombining intermediate propositional logics with classical logic
In [17], we introduced a modal logic, called L, which combines intuitionistic propositional logic IPC and classical propositional logic CPC and is complete w.r.t. an algebraic semantics. However, L seems to be too weak for Kripke-style semantics. In this paper, we add positive and negative introspection and show that the resulting logic L5 has a Kripke semantics. For intermediate logics I , we ...
متن کاملHypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
In this paper we define cut-free hypersequent calculi for some intermediate logics semantically characterized by bounded Kripke models. In particular we consider the logics characterized by Kripke models of bounded width Bwk, by Kripke models of bounded cardinality Bck and by linearly ordered Kripke models of bounded cardinality Gk. The latter family of logics coincides with finite-valued Gödel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1992
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093634486